Multiple Parallel-Pollard's Rho Discrete Logarithm Algorithm
نویسندگان
چکیده
منابع مشابه
Performance Analysis of Parallel Pollard's Rho Algorithm
Integer factorization is one of the vital algorithms discussed as a part of analysis of any black-box cipher suites where the cipher algorithm is based on number theory. The origin of the problem is from Discrete Logarithmic Problem which appears under the analysis of the cryptographic algorithms as seen by a cryptanalyst. The integer factorization algorithm poses a potential in computational s...
متن کاملA Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm
We show a Birthday Paradox for self-intersections of Markov chains with uniform stationary distribution. As an application, we analyze Pollard’s Rho algorithm for finding the discrete logarithm in a cyclic group G and find that, if the partition in the algorithm is given by a random oracle, then with high probability a collision occurs in Θ( √ |G|) steps. Moreover, for the parallelized distingu...
متن کاملOn a Probabilistic Algorithm Solving Discrete Logarithm Problem
Recently, Gadiyar et al. presented a probabilistic algorithm solving discrete logarithm problem over finite fields. In this paper, we compare the running time of this algorithm with Pollard’s rho algorithm and we improve the required memory of the algorithm as a negligable memory by using some collision detection algorithms. 2000 Mathematics Subject Classification: 11Y16.
متن کاملNew algorithm for the discrete logarithm problem on elliptic curves
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of Boolean equations. Under a first fall degree assumption the regularity degree of the system is at most 4. Extensive experimental data which supports the assu...
متن کاملCertificateless Signature Scheme Based on Rabin Algorithm and Discrete Logarithm
Certificateless signature is one of the most important security primitives which can be used to solve the key escrow problem existing in ID-based signature. The security of most certificateless signatures depends only based on one mathematical hard problem. This means that once the underlying hard problem is broken, the signature will be broken, too. In this paper, a certificateless signature w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Society of Computer and Information
سال: 2015
ISSN: 1598-849X
DOI: 10.9708/jksci.2015.20.8.029